Abstraction-Based Information Technology: A Framework for Open Mechanized Reasoning
نویسنده
چکیده
ion-Based Information Technology: A Framework for Open Mechanized Reasoning.
منابع مشابه
Abstraction Based Information Technology
ion in AI and CS In the early days of CS, algorithms were often seen as an abstract formulation of procedures. Nowadays, this workshop illustrates well that category theory is associated to an abstract formulation of CS. The example of computer algebra teaches us that such methodologies do not amount to a full abstraction paradigm. Giunchiglia and Walsh introduced theories of abstraction for me...
متن کاملMechanized Reasoning Systems : a Preliminary Report ?
It is widely recognised that the integration of diierent (sub)-provers is a key issue in the construction of reasoning tools of practical usage. Unfortunately experience shows that eeective integration is very diicult to achieve. The Open Mechanized Reasoning Systems (OMRS) Project started in 1992 with the objective to design a formal framework for the speciication of state-of-the-art provers. ...
متن کاملSpecification and Integration of Theorem Provers and Computer Algebra Systems
Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities. CASs focus on efficiently solving domain-specific problems. ATPs are designed to allow for the formalization and solution of wide classes of problems within some logical framework. Integrating CASs and ATPs allows for the solution of problems of a higher complexity than those confronted by each...
متن کاملA Framework for Open Mechanized Legal Reasoning
We build on the analogy between theorem proving and legal reasoning. In the former case it was shown that mechanized reasoning is always achieved provided there is a theory, a control on this theory and some rules governing this controlled theory once introduced in a given environment. We show that it is possible to identify similar conditions for cognitive systems and also in the legal world. ...
متن کاملMechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning about sharing and aliasing in pointer-based data structures. Both of these are difficulties for reasoning in separation logic because they rely, fundamentally, on non-separate heaps. We show how sharing can be achieve...
متن کامل